0.07/0.12	% Problem    : SLH111^1 : TPTP v7.5.0. Released v7.5.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n006.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 30
0.13/0.34	% WCLimit    : 30
0.13/0.34	% DateTime   : Tue Aug  9 02:25:59 EDT 2022
0.13/0.34	% CPUTime    : 
0.20/0.47	The problem SPC is TH0_THM_EQU_NAR
0.20/0.47	Running higher-order on 1 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.20/0.52	# Preprocessing class: HSLSSMSSSSSNHSA.
0.20/0.52	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.20/0.52	# Starting full_lambda_9 with 30s (1) cores
0.20/0.52	# full_lambda_9 with pid 24235 completed with status 0
0.20/0.52	# Result found by full_lambda_9
0.20/0.52	# Preprocessing class: HSLSSMSSSSSNHSA.
0.20/0.52	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.20/0.52	# Starting full_lambda_9 with 30s (1) cores
0.20/0.52	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.20/0.52	# ...ProofStateSinE()=188/290
0.20/0.52	# Search class: HGHSM-FSLM21-MHSFFSBN
0.20/0.52	# partial match(1): HGHSM-FSLM31-MHSFFSBN
0.20/0.52	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.20/0.52	# Starting almost_fo_1 with 17s (1) cores
0.20/0.52	# almost_fo_1 with pid 24244 completed with status 0
0.20/0.52	# Result found by almost_fo_1
0.20/0.52	# Preprocessing class: HSLSSMSSSSSNHSA.
0.20/0.52	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.20/0.52	# Starting full_lambda_9 with 30s (1) cores
0.20/0.52	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.20/0.52	# ...ProofStateSinE()=188/290
0.20/0.52	# Search class: HGHSM-FSLM21-MHSFFSBN
0.20/0.52	# partial match(1): HGHSM-FSLM31-MHSFFSBN
0.20/0.52	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.20/0.52	# Starting almost_fo_1 with 17s (1) cores
0.20/0.52	# Preprocessing time       : 0.004 s
0.20/0.52	# Presaturation interreduction done
0.20/0.52	
0.20/0.52	# Proof found!
0.20/0.52	# SZS status Theorem
0.20/0.52	# SZS output start CNFRefutation
0.20/0.52	thf(decl_22, type, condit1627435690bove_a: (a > a > $o) > set_a > $o).
0.20/0.52	thf(decl_23, type, condit1001553558elow_a: (a > a > $o) > set_a > $o).
0.20/0.52	thf(decl_24, type, finite40241356em_a_a: (a > a > a) > $o).
0.20/0.52	thf(decl_25, type, abel_semigroup_a: (a > a > a) > $o).
0.20/0.52	thf(decl_26, type, semigroup_a: (a > a > a) > $o).
0.20/0.52	thf(decl_27, type, lattice_a: (a > a > a) > (a > a > $o) > (a > a > $o) > (a > a > a) > $o).
0.20/0.52	thf(decl_28, type, semilattice_a: (a > a > a) > $o).
0.20/0.52	thf(decl_29, type, semilattice_order_a: (a > a > a) > (a > a > $o) > (a > a > $o) > $o).
0.20/0.52	thf(decl_30, type, lattic655834328_set_a: (a > a > a) > (a > a > $o) > (a > a > $o) > $o).
0.20/0.52	thf(decl_31, type, lattic1885654924_set_a: (a > a > a) > $o).
0.20/0.52	thf(decl_32, type, modula1376131916tice_a: (a > a > a) > (a > a > $o) > (a > a > a) > a > a > a > $o).
0.20/0.53	thf(decl_33, type, modula397570059tice_a: (a > a > a) > (a > a > $o) > (a > a > a) > a > a > a > $o).
0.20/0.53	thf(decl_34, type, modula17988509_aux_a: (a > a > a) > (a > a > a) > a > a > a > a).
0.20/0.53	thf(decl_35, type, modula1373251614_aux_a: (a > a > a) > (a > a > a) > a > a > a > a).
0.20/0.53	thf(decl_36, type, modula581031071_aux_a: (a > a > a) > (a > a > a) > a > a > a > a).
0.20/0.53	thf(decl_37, type, modula1936294176_aux_a: (a > a > a) > (a > a > a) > a > a > a > a).
0.20/0.53	thf(decl_38, type, modula1144073633_aux_a: (a > a > a) > (a > a > a) > a > a > a > a).
0.20/0.53	thf(decl_39, type, modula1727524044comp_a: (a > a > $o) > a > a > $o).
0.20/0.53	thf(decl_40, type, modula1962211574trib_a: (a > a > a) > (a > a > $o) > (a > a > a) > a > a > a > $o).
0.20/0.53	thf(decl_41, type, least_a: (a > a > $o) > (a > $o) > a).
0.20/0.53	thf(decl_42, type, max_a: (a > a > $o) > a > a > a).
0.20/0.53	thf(decl_43, type, min_a: (a > a > $o) > a > a > a).
0.20/0.53	thf(decl_44, type, greatest_a: (a > a > $o) > (a > $o) > a).
0.20/0.53	thf(decl_45, type, ordering_a: (a > a > $o) > (a > a > $o) > $o).
0.20/0.53	thf(decl_46, type, collect_a: (a > $o) > set_a).
0.20/0.53	thf(decl_47, type, set_gr1491433118Than_a: (a > a > $o) > a > a > set_a).
0.20/0.53	thf(decl_48, type, member_a: a > set_a > $o).
0.20/0.53	thf(decl_49, type, inf: a > a > a).
0.20/0.53	thf(decl_50, type, less: a > a > $o).
0.20/0.53	thf(decl_51, type, less_eq: a > a > $o).
0.20/0.53	thf(decl_52, type, sup: a > a > a).
0.20/0.53	thf(decl_53, type, x: a).
0.20/0.53	thf(decl_54, type, y: a).
0.20/0.53	thf(decl_55, type, z: a).
0.20/0.53	thf(decl_56, type, esk1_1: (a > a > a) > a).
0.20/0.53	thf(decl_57, type, esk2_1: (a > a > a) > a).
0.20/0.53	thf(decl_58, type, esk3_1: (a > a > a) > a).
0.20/0.53	thf(decl_59, type, esk4_1: (a > a > a) > a).
0.20/0.53	thf(decl_60, type, esk5_1: (a > a > a) > a).
0.20/0.53	thf(decl_61, type, esk6_1: (a > a > a) > a).
0.20/0.53	thf(decl_62, type, esk7_1: (a > a > a) > a).
0.20/0.53	thf(decl_63, type, esk8_0: a).
0.20/0.53	thf(decl_64, type, esk9_0: a).
0.20/0.53	thf(decl_65, type, esk10_0: a).
0.20/0.53	thf(decl_66, type, esk11_0: a).
0.20/0.53	thf(decl_67, type, esk12_0: a).
0.20/0.53	thf(decl_68, type, esk13_0: a).
0.20/0.53	thf(decl_69, type, esk14_1: (a > a > a) > a).
0.20/0.53	thf(decl_70, type, esk15_1: (a > a > a) > a).
0.20/0.53	thf(decl_71, type, esk16_1: (a > a > a) > a).
0.20/0.53	thf(decl_72, type, esk17_1: (a > a > a) > a).
0.20/0.53	thf(decl_73, type, esk18_1: (a > a > a) > a).
0.20/0.53	thf(decl_74, type, esk19_1: (a > a > a) > a).
0.20/0.53	thf(decl_75, type, esk20_1: (a > a > a) > a).
0.20/0.53	thf(fact_74_local_Oinf_OboundedE, axiom, ![X4:a, X3:a, X9:a]:(((less_eq @ X4 @ (inf @ X3 @ X9))=>~(((less_eq @ X4 @ X3)=>~((less_eq @ X4 @ X9)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_74_local_Oinf_OboundedE)).
0.20/0.53	thf(fact_50_local_Odual__order_Oorder__iff__strict, axiom, ![X3:a, X4:a]:(((less_eq @ X3 @ X4)<=>((less @ X3 @ X4)|((X4)=(X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_50_local_Odual__order_Oorder__iff__strict)).
0.20/0.53	thf(conj_4, conjecture, (less_eq @ (inf @ (sup @ x @ (inf @ y @ z)) @ z) @ y), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_4)).
0.20/0.53	thf(fact_33_local_Oinf_Ocommute, axiom, ![X4:a, X3:a]:(((inf @ X4 @ X3)=(inf @ X3 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_33_local_Oinf_Ocommute)).
0.20/0.53	thf(conj_3, hypothesis, (less @ (sup @ x @ (inf @ y @ z)) @ (inf @ y @ (sup @ x @ z))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_3)).
0.20/0.53	thf(fact_79_local_Oinf_OcoboundedI2, axiom, ![X3:a, X9:a, X4:a]:(((less_eq @ X3 @ X9)=>(less_eq @ (inf @ X4 @ X3) @ X9))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_79_local_Oinf_OcoboundedI2)).
0.20/0.53	thf(c_0_6, plain, ![X4:a, X3:a, X9:a]:(((less_eq @ X4 @ (inf @ X3 @ X9))=>~(((less_eq @ X4 @ X3)=>~(less_eq @ X4 @ X9))))), inference(fof_simplification,[status(thm)],[fact_74_local_Oinf_OboundedE])).
0.20/0.53	thf(c_0_7, plain, ![X735:a, X736:a]:(((~(less_eq @ X735 @ X736)|((less @ X735 @ X736)|((X736)=(X735))))&((~(less @ X735 @ X736)|(less_eq @ X735 @ X736))&(((X736)!=(X735))|(less_eq @ X735 @ X736))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_50_local_Odual__order_Oorder__iff__strict])])])).
0.20/0.53	thf(c_0_8, negated_conjecture, ~(less_eq @ (inf @ (sup @ x @ (inf @ y @ z)) @ z) @ y), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_4])])).
0.20/0.53	thf(c_0_9, plain, ![X903:a, X904:a]:(((inf @ X903 @ X904)=(inf @ X904 @ X903))), inference(variable_rename,[status(thm)],[fact_33_local_Oinf_Ocommute])).
0.20/0.53	thf(c_0_10, plain, ![X831:a, X832:a, X833:a]:((((less_eq @ X831 @ X832)|~(less_eq @ X831 @ (inf @ X832 @ X833)))&((less_eq @ X831 @ X833)|~(less_eq @ X831 @ (inf @ X832 @ X833))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
0.20/0.53	thf(c_0_11, plain, ![X1:a, X2:a]:(((less_eq @ X1 @ X2)|~((less @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.53	thf(c_0_12, hypothesis, (less @ (sup @ x @ (inf @ y @ z)) @ (inf @ y @ (sup @ x @ z))), inference(split_conjunct,[status(thm)],[conj_3])).
0.20/0.53	thf(c_0_13, negated_conjecture, ~((less_eq @ (inf @ (sup @ x @ (inf @ y @ z)) @ z) @ y)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.53	thf(c_0_14, plain, ![X2:a, X1:a]:(((inf @ X1 @ X2)=(inf @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_9])).
0.20/0.53	thf(c_0_15, plain, ![X844:a, X845:a, X846:a]:((~(less_eq @ X844 @ X845)|(less_eq @ (inf @ X846 @ X844) @ X845))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_79_local_Oinf_OcoboundedI2])])).
0.20/0.53	thf(c_0_16, plain, ![X1:a, X2:a, X3:a]:(((less_eq @ X1 @ X2)|~((less_eq @ X1 @ (inf @ X2 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.53	thf(c_0_17, hypothesis, (less_eq @ (sup @ x @ (inf @ y @ z)) @ (inf @ y @ (sup @ x @ z))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.20/0.53	thf(c_0_18, negated_conjecture, ~((less_eq @ (inf @ z @ (sup @ x @ (inf @ y @ z))) @ y)), inference(rw,[status(thm)],[c_0_13, c_0_14])).
0.20/0.53	thf(c_0_19, plain, ![X1:a, X3:a, X2:a]:(((less_eq @ (inf @ X3 @ X1) @ X2)|~((less_eq @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.20/0.53	thf(c_0_20, hypothesis, (less_eq @ (sup @ x @ (inf @ y @ z)) @ y), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.20/0.53	thf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])]), ['proof']).
0.20/0.53	# SZS output end CNFRefutation
0.20/0.53	# Parsed axioms                        : 290
0.20/0.53	# Removed by relevancy pruning/SinE    : 102
0.20/0.53	# Initial clauses                      : 244
0.20/0.53	# Removed in clause preprocessing      : 5
0.20/0.53	# Initial clauses in saturation        : 239
0.20/0.53	# Processed clauses                    : 446
0.20/0.53	# ...of these trivial                  : 17
0.20/0.53	# ...subsumed                          : 181
0.20/0.53	# ...remaining for further processing  : 248
0.20/0.53	# Other redundant clauses eliminated   : 21
0.20/0.53	# Clauses deleted for lack of memory   : 0
0.20/0.53	# Backward-subsumed                    : 9
0.20/0.53	# Backward-rewritten                   : 3
0.20/0.53	# Generated clauses                    : 1070
0.20/0.53	# ...of the previous two non-redundant : 740
0.20/0.53	# ...aggressively subsumed             : 0
0.20/0.53	# Contextual simplify-reflections      : 3
0.20/0.53	# Paramodulations                      : 1042
0.20/0.53	# Factorizations                       : 0
0.20/0.53	# NegExts                              : 0
0.20/0.53	# Equation resolutions                 : 21
0.20/0.53	# Propositional unsat checks           : 0
0.20/0.53	#    Propositional check models        : 0
0.20/0.53	#    Propositional check unsatisfiable : 0
0.20/0.53	#    Propositional clauses             : 0
0.20/0.53	#    Propositional clauses after purity: 0
0.20/0.53	#    Propositional unsat core size     : 0
0.20/0.53	#    Propositional preprocessing time  : 0.000
0.20/0.53	#    Propositional encoding time       : 0.000
0.20/0.53	#    Propositional solver time         : 0.000
0.20/0.53	#    Success case prop preproc time    : 0.000
0.20/0.53	#    Success case prop encoding time   : 0.000
0.20/0.53	#    Success case prop solver time     : 0.000
0.20/0.53	# Current number of processed clauses  : 109
0.20/0.53	#    Positive orientable unit clauses  : 40
0.20/0.53	#    Positive unorientable unit clauses: 4
0.20/0.53	#    Negative unit clauses             : 25
0.20/0.53	#    Non-unit-clauses                  : 40
0.20/0.53	# Current number of unprocessed clauses: 631
0.20/0.53	# ...number of literals in the above   : 1183
0.20/0.53	# Current number of archived formulas  : 0
0.20/0.53	# Current number of archived clauses   : 122
0.20/0.53	# Clause-clause subsumption calls (NU) : 3004
0.20/0.53	# Rec. Clause-clause subsumption calls : 2618
0.20/0.53	# Non-unit clause-clause subsumptions  : 104
0.20/0.53	# Unit Clause-clause subsumption calls : 134
0.20/0.53	# Rewrite failures with RHS unbound    : 0
0.20/0.53	# BW rewrite match attempts            : 125
0.20/0.53	# BW rewrite match successes           : 74
0.20/0.53	# Condensation attempts                : 0
0.20/0.53	# Condensation successes               : 0
0.20/0.53	# Termbank termtop insertions          : 25434
0.20/0.53	
0.20/0.53	# -------------------------------------------------
0.20/0.53	# User time                : 0.040 s
0.20/0.53	# System time              : 0.005 s
0.20/0.53	# Total time               : 0.045 s
0.20/0.53	# Maximum resident set size: 2972 pages
0.20/0.53	
0.20/0.53	# -------------------------------------------------
0.20/0.53	# User time                : 0.049 s
0.20/0.53	# System time              : 0.005 s
0.20/0.53	# Total time               : 0.055 s
0.20/0.53	# Maximum resident set size: 1936 pages
0.20/0.53	EOF